Learning to Map Sentences to Logical Form: Structured Classification with Probabilistic Categorial Grammars
نویسندگان
چکیده
This paper addresses the problem of mapping natural language sentences to lambda–calculus encodings of their meaning. We describe a learning algorithm that takes as input a training set of sentences labeled with expressions in the lambda calculus. The algorithm induces a grammar for the problem, along with a log-linear model that represents a distribution over syntactic and semantic analyses conditioned on the input sentence. We apply the method to the task of learning natural language interfaces to databases and show that the learned parsers outperform previous methods in two benchmark database domains.
منابع مشابه
Learning to Map Chinese Sentences to Logical Forms
This paper addresses the problem of learning to map Chinese sentences to logical forms. The training data consist of Chinese natural language sentences paired with logical representations of their meaning. Although many approaches have been developed for learning to map from some western natural languages to two different meaning representations, there is no such approached for Chinese language...
متن کاملLearning Rigid Lambek Grammars and Minimalist Grammars from Structured Sentences
We present an extension of Buszkowski’s learning algorithm for categorial grammars to rigid Lambek grammars and then for minimalist categorial grammars. The Kanazawa proof of the convergence in the Gold sense is simplified and extended to these new algorithms. We thus show that this technique based on principal type algorithm and type unification is quite general and applies to learning issues ...
متن کاملk-Valued non-associative Lambek grammars are learnable from generalized functor-argument structures
This paper is concerned with learning categorial grammars from positive examples in the model of Gold. Functor-argument structures (written FA) are usual syntactical decompositions of sentences in sub-components distinguishing the functional parts from the argument parts defined in the case of classical categorial grammars also known as AB-grammars. In the case of non-associative type-logical g...
متن کاملInducing Probabilistic CCG Grammars from Logical Form with Higher-Order Unification
This paper addresses the problem of learning to map sentences to logical form, given training data consisting of natural language sentences paired with logical representations of their meaning. Previous approaches have been designed for particular natural languages or specific meaning representations; here we present a more general method. The approach induces a probabilistic CCG grammar that r...
متن کاملCategorial Minimalist Grammar
1. Convergence at first sight, and differences in a second time From the early days of the minimalist program of Chomsky (1993), a convergence with categorial grammars was noticed by Ep-stein and Berwick (1995). The striking similarity lies in the merge operation, which looks like the application rule of the AB grammars. In both cases, word order is a consequence of the consumption rules but in...
متن کامل